Back to course home
0% completed
Vote For New Content
Introduction
Course Overview
Basics of Tree
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Level Order Traversal Pattern (easy)
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal (easy)
Solution: Reverse Level Order Traversal
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row
Maximum Width of Binary Tree (medium)
Solution: Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Zigzag Traversal (medium)
Solution: Zigzag Traversal
Even Odd Tree (medium)
Solution: Even Odd Tree
N-ary Tree Level Order Traversal (hard)
Solution: N-ary Tree Level Order Traversal
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Create Binary Tree From Descriptions (medium)
Problem Statement
You are given a 2D list called descriptions. Each element in descriptions represents a relationship in a binary tree. The element descriptions[i] = [parenti, childi, isLefti] tells us that parenti is the paent of childi. The isLefti value can be either 1 or 0:
- If isLefti is 1,
childiis the left child of parenti. - If isLefti is 0, childi is the right child of parenti.
Build this binary tree from the given description and return its root node.
Each node in the binary tree has a unique value.
Examples
Example 1
- Input: descriptions =
[[1, 2, 1], [1, 3, 0], [2, 4, 1]] - Expected Output: [1, 2, 3, 4]
- Justification: Node 1 is the root, 2 is the left child, 3 is the right child. Node 2 has 4 as its left child.
Example 2:
- Input: descriptions =
[[10, 5, 1], [10, 15, 0], [5, 3, 1], [15, 20, 0]] - Expected Output: [10,5,15,3,null,null,20]
- Justification: Node 10 is the root, with 5 as the left child and 15 as the right child. Node 5 has 3 as its left child, and 15 has 20 as its right child.
Example 3:
- Input: descriptions =
[[5, 3, 1], [5, 7, 0], [3, 2, 1], [3, 4, 0]] - Expected Output: [5,3,7,2,4]
- Justification: Node 5 is the root with 3 as the left child and 7 as the right child. Node 3 has 2 as the left child and 4 as the right child.
Constraints:
- 1 <= descriptions.length <= 104
- descriptions[i].length == 3
- 1 <= parenti, childi <= 105
- 0 <= isLefti <= 1
- The binary tree described by descriptions is valid.
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Verify Preorder Serialization of a Binary Tree
Solution: Create Binary Tree From Descriptions
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself